Gdalyah Wiseman 1926–96

WISEMAN Ver. 0.91

We introduce WISEMAN (Wireless Sensors Employing Mobile AgeNts), a mobile-code system for the programmable control of distributed tasks in wireless sensor networks. WISEMAN’s architecture and language constructs decouple the coordination element of distributed processes from the actual data processing in order to produce ultra-compact agents that may help to reduce bandwidth utilization. WISEMA...

Programmable Re-tasking of Wireless Sensor Networks Using WISEMAN

In this paper we present a flexible middleware platform for re-tasking Wireless Sensor Networks (WSNs) that we coin WISEMAN. Based on our previous experiences with mobile agents in computer networks, we developed a lightweight interpreter of text-based codes that enables their deployment in order to implement diverse WSNs tasks. WISEMAN occupies 19Kbytes of TinyOS embedded code, and 3 Kbytes of...

Addendum to “a Fixed Point Theorem for Bounded Dynamical Systems” David Richeson and Jim Wiseman

(A map is locally compact if every point has a neighborhood whose image is precompact.) Theorem 1 for maps is thus a special case of this result. In fact, the results in [2] go far beyond Theorem 2 and are concerned with finding very general circumstances in which the Lefschetz fixed point theorem applies. Further important work in this area appears in [1], [3], [4]. Srzednicki proved the follo...

Design, Implementation and Case Study of WISEMAN: WIreless Sensors Employing Mobile AgeNts

We describe the practical implementation of Wiseman: our proposed scheme for running mobile agents in Wireless Sensor Networks. Wiseman’s architecture derives from a much earlier agent system originally conceived for distributed process coordination in wired networks. Given the memory constraints associated with small sensor devices, we revised the architecture of the original agent system to m...

First - class Interpreters : Illustrating the LimitsImposed by Representation in a Re ectiveLanguageJohn Wiseman Simmons